A Classical Realizability Model for a Semantical Value Restriction
نویسنده
چکیده
We present a new type system with support for proofs of programs in a call-by-value language with control operators. The proof mechanism relies on observational equivalence of (untyped) programs. It appears in two type constructors, which are used for specifying program properties and for encoding dependent products. The main challenge arises from the lack of expressiveness of dependent products due to the value restriction. To circumvent this limitation we relax the syntactic restriction and only require equivalence to a value. The consistency of the system is obtained semantically by constructing a classical realizability model in three layers (values, stacks and terms).
منابع مشابه
9- Algebraization of realizability
In the rst parts of this thesis, we introduced several calculi for which we gave a Krivine realizability interpretation. Namely, in addition to Krivine’s λc -calculus, we presented interpretations for the callby-name, call-by-value and call-by-need λμμ̃-calculi, for dLt̂p and for dLPAω . Amongst others, we could cite Munch-Maccagnoni’s interpretation for System L [126], Lepigre’s interpretation ...
متن کامل9- Algebraization of realizability
In the rst parts of this thesis, we introduced several calculi for which we gave a Krivine realizability interpretation. Namely, in addition to Krivine’s λc -calculus, we presented interpretations for the callby-name, call-by-value and call-by-need λμμ̃-calculi, for dLt̂p and for dLPAω . Amongst others, we could cite Munch-Maccagnoni’s interpretation for System L [126], Lepigre’s interpretation ...
متن کاملA Realizability Model for a Semantical Value Restriction
Reconciling dependent product and classical logic with call-by-value evaluation is a difficult problem. It is the first step toward a classical proof system for an ML-like language. In such a system, the introduction rule for universal quantification and the elimination rule for dependent product need to be restricted: they can only be applied to values. This value restriction is acceptable for...
متن کاملQuantitative Models and Implicit Complexity
We give new proofs of soundness (all representable functions on base types lies in certain complexity classes) for Elementary Affine Logic, LFPL (a language for polytime computation close to realistic functional programming introduced by one of us), Light Affine Logic and Soft Affine Logic. The proofs are based on a common semantical framework which is merely instantiated in four different ways...
متن کاملRealizability models for a linear dependent PCF
Recently, Dal Lago and Gaboardi have proposed a type system, named d`PCF as a framework for implicit computational complexity. d`PCF is a non-standard type system for PCF programs which is relatively complete with respect to complexity properties thanks to the use of linear types inspired by Bounded linear logic and dependent types à la Dependent ML. In this work, we adapt the framework of quan...
متن کامل